- classical optimization techniques
- классические методы оптимизации
Англо-русский словарь промышленной и научной лексики. 2014.
classical optimization techniques
Смотреть что такое "classical optimization techniques" в других словарях:
Mathematical optimization — For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… … Wikipedia
Multidisciplinary design optimization — Multi disciplinary design optimization (MDO) is a field of engineering that uses optimization methods to solve design problems incorporating a number of disciplines. As defined by Prof. Carlo Poloni, MDO is the art of finding the best compromise … Wikipedia
Particle swarm optimization — (PSO) is a swarm intelligence based algorithm to find a solution to an optimization problem in a search space, or model and predict social behavior in the presence of objectives.OverviewParticle swarm optimization is a stochastic, population… … Wikipedia
Multidimensional scaling — (MDS) is a set of related statistical techniques often used in information visualization for exploring similarities or dissimilarities in data. MDS is a special case of ordination. An MDS algorithm starts with a matrix of item–item similarities,… … Wikipedia
Workflow — A workflow is a depiction of a sequence of operations, declared as work of a person, work of a simple or complex mechanism, work of a group of persons, [See e.g., ISO 12052:2006, [http://www.iso.org] ] work of an organization of staff, or… … Wikipedia
Mathematics of radio engineering — A complex valued function. The mathematics of radio engineering is a pleasant and very useful subject. This article is an attempt to provide a reasonably comprehensive summary of this almost limitless topic. While the ideas have historically… … Wikipedia
Vertex cover — In the mathematical discipline of graph theory, a vertex cover of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of the set. The problem of finding a minimum vertex cover is a classical… … Wikipedia
H-infinity methods in control theory — H ∞ (i.e. H infinity ) methods are used in control theory to synthesize controllers achieving robust performance or stabilization. To use H ∞ methods, a control designer expresses the control problem as a mathematical optimization problem and… … Wikipedia
Continuation-passing style — In functional programming, continuation passing style (CPS) is a style of programming in which control is passed explicitly in the form of a continuation. Gerald Jay Sussman and Guy L. Steele, Jr. coined the phrase in AI Memo 349 (1975), which… … Wikipedia
Hans-Paul Schwefel — (born December 4, 1940 in Berlin) is a German computer scientist and professor emeritus at University of Dortmund (now Dortmund University of Technology), where he held the chair of systems analysis from 1985 until 2006. He is one of the pioneers … Wikipedia
Columbia School of Engineering and Applied Science — School of Engineering and Applied Science redirects here. For other uses, see School of Engineering and Applied Science (disambiguation). Fu Foundation School of Engineering and Applied Science Established … Wikipedia
